翻訳と辞書 Words near each other ・ "O" Is for Outlaw ・ "O"-Jung.Ban.Hap. ・ "Ode-to-Napoleon" hexachord ・ "Oh Yeah!" Live ・ "Our Contemporary" regional art exhibition (Leningrad, 1975) ・ "P" Is for Peril ・ "Pimpernel" Smith ・ "Polish death camp" controversy ・ "Pro knigi" ("About books") ・ "Prosopa" Greek Television Awards ・ "Pussy Cats" Starring the Walkmen ・ "Q" Is for Quarry ・ "R" Is for Ricochet ・ "R" The King (2016 film) ・ "Rags" Ragland ・ ! (album) ・ ! (disambiguation) ・ !! ・ !!! ・ !!! (album) ・ !!Destroy-Oh-Boy!! ・ !Action Pact! ・ !Arriba! La Pachanga ・ !Hero ・ !Hero (album) ・ !Kung language ・ !Oka Tokat ・ !PAUS3 ・ !T.O.O.H.! ・ !Women Art Revolution Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク graph homomorphism ： ウィキペディア英語版 graph homomorphism In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps adjacent vertices to adjacent vertices. ==Definitions== A graph homomorphism $f$ from a graph $G=(V,E)$ to a graph $G\text{'}=(V\text{'},E\text{'})$, written $f:G\; \backslash rightarrow\; G\text{'}$, is a mapping $f:V\; \backslash rightarrow\; V\text{'}$ from the vertex set of $G$ to the vertex set of $G\text{'}$ such that $\backslash \backslash in\; E$ implies $\backslash \backslash in\; E\text{'}$. The above definition is extended to directed graphs. Then, for a homomorphism $f:G\; \backslash rightarrow\; G\text{'}$, $(f(u),f(v))$ is an arc of $G\text{'}$ if $(u,v)$ is an arc of $G$. If there exists a homomorphism $f:G\backslash rightarrow\; H$ we shall write $G\backslash rightarrow\; H$, and $G\backslash not\backslash rightarrow\; H$ otherwise. If $G\backslash rightarrow\; H$, $G$ is said to be homomorphic to $H$ or $H$-colourable. If the homomorphism $f:G\backslash rightarrow\; G\text{'}$ is a bijection whose inverse function is also a graph homomorphism, then $f$ is a graph isomorphism. Two graphs $G$ and $G\text{'}$ are homomorphically equivalent if $G\backslash rightarrow\; G\text{'}$ and $G\text{'}\backslash rightarrow\; G$. A retract of a graph $G$ is a subgraph $H$ of $G$ such that there exists a homomorphism $r:G\backslash rightarrow\; H$, called retraction with $r(x)=x$ for any vertex $x$ of $H$. A core is a graph which does not retract to a proper subgraph. Any graph is homomorphically equivalent to a unique core. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「graph homomorphism」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.